Universal tilings and universal (0,1)-matrices
نویسندگان
چکیده
منابع مشابه
Universal groups for point-sets and tilings
We study the universal groups of inverse semigroups associated with point sets and with tilings. We focus our attention on two classes of examples. The first class consists of point sets which are obtained by a cut and projection scheme (so-called model sets). Here we introduce another inverse semigroup which is given in terms of the defining data of the projection scheme and related to the mod...
متن کاملFLOWS AND UNIVERSAL COMPACTIFICATIONS
The main purpose of this paper is to establish a relation between universality of certain P-compactifications of a semitopological semigroup and their corresponding enveloping semigroups. In particular, we show that if we take P to be the property that the enveloping semigroup of a compactification of a semitopological semigroup s is left simple, a group, or the trivial singleton semigroup, t...
متن کاملQuasi-Universal Switch Matrices for FPD Design
ÐAn FPD switch module M with w terminals on each side is said to be universal if every set of nets satisfying the dimension constraint (i.e., the number of nets on each side of M is at most w) is simultaneously routable through M [8]. Chang et al. have identified a class of universal switch blocks in [8]. In this paper, we consider the design and routing problems for another popular model of sw...
متن کاملflows and universal compactifications
the main purpose of this paper is to establish a relation between universality of certain p-compactifications of a semitopological semigroup and their corresponding enveloping semigroups. in particular, we show that if we take p to be the property that the enveloping semigroup of a compactification of a semitopological semigroup s is left simple, a group, or the trivial singleton semigroup, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90189-5